package com.tucc.hello.leetcode.no1_400.no1_200.no61_80.no62;

/**
 * @author tucc
 * @description todo
 * @package com.tucc.hello.leetcode
 * @date 2021/5/20
 **/
public class Solution {

    public static void main(String[] args) {
        Solution solution = new Solution();
        int m = 3, n = 7;
        System.out.println(solution.uniquePaths(m, n));
    }

    public int uniquePaths(int m, int n) {
        if (m > 0 && n > 0) {
            int[][] dp = new int[m + 1][n + 1];
            for (int i = 1; i <= m; i++) {
                dp[i][1] = 1;
            }
            for (int i = 1; i <= n; i++) {
                dp[1][i] = 1;
            }

            for (int i = 2; i <= m; i++) {
                for (int j = 2; j <= n; j++) {
                    dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
                }
            }
            return dp[m][n];
        }
        return 0;
    }
}
